package com.scheuk.euler;

public class p018 {

	/*
	 * By starting at the top of the triangle below and moving to adjacent numbers on the row below, 
	 * the maximum total from top to bottom is 23.
	 * 		3
	 * 		7 4
	 * 		2 4 6
	 * 		8 5 9 3
	 * That is, 3 + 7 + 4 + 9 = 23.
	 * NOTE: this reeks of tree traversing
	 */
	static void Problem18() {
		
	}

}
